-
1 order-complete subset
Большой англо-русский и русско-английский словарь > order-complete subset
-
2 order-complete subset
Математика: полное по упорядоченности подмножество -
3 order-complete subset
English-Russian scientific dictionary > order-complete subset
-
4 subset
1) телефон. абонентский аппарат2) подгруппа3) подкласс4) подмножество5) полукомплект•- almost open subset - almost unitary subset - bounded below subset - countably paracompact subset - everywhere dense subset - linearly independent subset - locally closed subset - locally polyhedral subset - locally tame subset - nonvoid subset - polynomially convex subset - potentially invertible subset - relatively compact subset - relatively pseudocompact subset - right perfect subset - right unitary subset - strongly dependent subset - strongly positive subset - totally ordered subset - uniformly integrable subset - universally measurable subset - weakly bounded subset - weakly closed subset - weakly invariant subset - weak-star closed subset - well ordered subset - well separated subset -
5 relation
1) зависимость, (взаимо)связь2) отношение; соотношение4) геол. условия залегания•- almost universal relation - cause-effect relation - generalized semigroup relation - logically irreducible relation - parametrically definable relation - partial ordering relation - recursively enumerable relation - recursively invariant relation - recursively representable relation - strongly definable relation - weakly symmetric relation
См. также в других словарях:
Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… … Wikipedia
Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… … Wikipedia
Complete partial order — In mathematics, directed complete partial orders and ω complete partial orders (abbreviated to dcpo, ωcpo or sometimes just cpo) are special classes of partially ordered sets, characterized by particular completeness properties. Complete partial… … Wikipedia
Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 … Wikipedia
Complete Boolean algebra — This article is about a type of mathematical structure. For complete sets of Boolean operators, see Functional completeness. In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound) … Wikipedia
Complete theory — In mathematical logic, a theory is complete if it is a maximal consistent set of sentences, i.e., if it is consistent, and none of its proper extensions is consistent. For theories in logics which contain classical propositional logic, this is… … Wikipedia
complete — completable, adj. completedness, n. completely, adv. completeness, n. completer, n. completive, adj. completively, adv. /keuhm pleet /, adj., v., completed, completing. adj … Universalium
Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be … Wikipedia
Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… … Wikipedia
List of first-order theories — In mathematical logic, a first order theory is given by a set of axioms in somelanguage. This entry lists some of the more common examples used in model theory and some of their properties. PreliminariesFor every natural mathematical structure… … Wikipedia
Total order — In set theory, a total order, linear order, simple order, or (non strict) ordering is a binary relation (here denoted by infix ≤) on some set X. The relation is transitive, antisymmetric, and total. A set paired with a total order is called a… … Wikipedia